Tasklettes - A Fine Grained Parallelism for Ada on Multicores

نویسندگان

  • Stephen Michell
  • Brad Moore
  • Luís Miguel Pinho
چکیده

The widespread use of multi-CPU computers is challenging programming languages, which need to adapt to be able to express potential parallelism at the language level. In this paper we propose a new model for fine grained parallelism in Ada, putting forward a syntax based on aspects, and the corresponding semantics to integrate this model with the existing Ada tasking capabilities. We also propose a standard interface and show how it can be extended by the user or library writers to implement their own parallelization strategies. © CISTER Research Center www.cister.isep.ipp.pt 1 Tasklettes – a Fine Grained Parallelism for Ada on Multicores Stephen Michell Brad Moore Luís Miguel Pinho 1 Maurya Software Inc, Canada, [email protected] 2 General Dynamics, Canada, [email protected] 3 CISTER/INESC-TEC, ISEP, Polytechnic Institute of Porto, Portugal, [email protected] Abstract. The widespread use of multi-CPU computers is challenging programming languages, which need to adapt to be able to express potential parallelism at the language level. In this paper we propose a new model for fine grained parallelism in Ada, putting forward a syntax based on aspects, and the corresponding semantics to integrate this model with the existing Ada tasking capabilities. We also propose a standard interface and show how it can be extended by the user or library writers to implement their own parallelization strategies. The widespread use of multi-CPU computers is challenging programming languages, which need to adapt to be able to express potential parallelism at the language level. In this paper we propose a new model for fine grained parallelism in Ada, putting forward a syntax based on aspects, and the corresponding semantics to integrate this model with the existing Ada tasking capabilities. We also propose a standard interface and show how it can be extended by the user or library writers to implement their own parallelization strategies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Execution Model for Fine-Grained Parallelism in Ada

This paper extends the authors earlier proposal for providing Ada with support for fine-grained parallelism with an execution model based on the concept of ab-stract executors, detailing the progress guarantees that these executors must pro-vide and how these can be assured even in the presence of potentially blocking operations. The paper also describes how this execution model can be applied ...

متن کامل

OpenMP Tasking Model for Ada: Safety and Correctness

The safety-critical real-time embedded domain increasingly demands the use of parallel architectures to fulfill performance requirements. Such architectures require the use of parallel programming models to exploit the underlying parallelism. This paper evaluates the applicability of using OpenMP, a widespread parallel programming model, with Ada, a language widely used in the safety-critical d...

متن کامل

Some Experiments on Tiling Loop Programs for Shared-Memory Multicore Architectures

The model-based transformation of loop programs is a way of detecting fine-grained parallelism in sequential programs. One of the challenges is to agglomerate the parallelism to a coarser grain, in order to map the operations of the program to the available cores in a multicore architecture. We consider shared-memory multicores as target architecture for space-time mapped loop programs and make...

متن کامل

Hybrid Multicore Cholesky Factorization with Multiple GPU Accelerators

We present a Cholesky factorization for multicore with GPU accelerators. The challenges in developing scalable high performance algorithms for these emerging systems stem from their heterogeneity, massive parallelism, and the huge gap between the GPUs’ compute power vs the CPU-GPU communication speed. We show an approach that is largely based on software infrastructures that have already been d...

متن کامل

Speculative Optimizations for Parallel Programs on Multicores

The advent of multicores presents a promising opportunity for exploiting fine grained parallelism present in programs. Programs parallelized in the above fashion, typically involve threads that communicate via shared memory, and synchronize with each other frequently to ensure that shared memory dependences between different threads are correctly enforced. Such frequent synchronization operatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013